Upper Bound on Correcting Partial Random Errors
نویسندگان
چکیده
منابع مشابه
On Linear Codes Correcting Random and Low-Denslty Burst Errors
This paper presents lower and upper bounds on the number of parity-check digits required for a linear code that corrects random errors and errors which are in the form of low-density bursts.
متن کاملReducing WCET Overestimations by Correcting Errors in Loop Bound Constraints
In order to reduce overestimations of worst-case execution time (WCET), in this article, we firstly report a kind of specific WCET overestimation caused by non-orthogonal nested loops. Then, we propose a novel correction approach which has three basic steps. The first step is to locate the worst-case execution path (WCEP) in the control flow graph and then map it onto source code. The second st...
متن کاملOn the aliasing error upper bound for homogeneous random fields
The Brown aliasing error upper bound in the sampling cardinal series expansion (SCSE) of weakly stationary non-bandlimited (NBL) stochastic processes is extended to NBL homogeneous random fields (HRF). The magnitude of the derived bound is ordered under some smoothness condition upon the field. Zusammenfassung. Die Brown'sche Abschitzung der Obergrenze von Aliasing Fehlern bei der Abtastung von...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملAn upper bound associated with errors in Gray code (Corresp.)
-Suppose 0 I i, j I 2” 1. We prove that, if i, j are encoded as binary Gray codewords whose Hamming distance is M 2 1, then Ii jl < 2” 2m/3. In [I], Yuen finds a lower bound on the signal error that produces an m-bit error in its Gray codeword. Denoting the Gray codeword for i by g(i), he proves that if the Hamming distance between g(i) and g(j) is m 2 1, then (i j] > 2m/3. The object of this c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cybernetics and Information Technologies
سال: 2013
ISSN: 1314-4081,1311-9702
DOI: 10.2478/cait-2013-0024